Finite-Degree Predicates and Two-Variable First-Order Logic
نویسنده
چکیده
We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the order predicate only. From this result we derive the separation of the alternation hierarchy of two-variable logic on this signature.
منابع مشابه
Satisfiability of the Two-Variable Fragment of First-Order Logic over Trees
We consider the satisfiability problem for the two-variable fragment of first-order logic over finite unranked trees. We work with signatures consisting of some unary predicates and the binary navigational predicates ↓ (child), → (right sibling), and their respective transitive closures ↓+, → . We prove that the satisfiability problem for the logic containing all these predicates, FO[↓, ↓+,→,→ ...
متن کاملTwo-variable first order logic with modular predicates over words
We consider first order formulae over the signature consisting of the symbols of the alphabet, the symbol < (interpreted as a linear order) and the set MOD of modular numerical predicates. We study the expressive power of FO2[<,MOD], the two-variable first order logic over this signature, interpreted over finite words. We give an algebraic characterization of the corresponding regular languages...
متن کاملAlternation Hierarchies of First Order Logic with Regular Predicates
We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with regular numerical predicates. In this paper, we focus on the quantifier alternation hierarchies of first order logic. We obtain that deciding this problem for each level of the alternation hierarchy of both first order logic and its twovariable fragment when equipped wi...
متن کاملThe Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable
The two-variable fragment, henceforth denoted L, is the fragment of firstorder logic with equality but without function-symbols, in which only two logical variables may appear. It is well-known that L has the finite model property, and that its satisfiability (= finite satisfiability) problem is NEXPTIME-complete [3]. It follows that it is impossible, within L, to express the condition that a g...
متن کاملEquivalence closure in the two-variable guarded fragment
We consider the satisfiability and finite satisfiability problems for the extension of the two-variable guarded fragment in which an equivalence closure operator can be applied to two distinguished binary predicates. We show that the satisfiability and finite satisfiability problems for this logic are 2-ExpTime-complete. This contrasts with an earlier result that the corresponding problems for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015